Direct tensor-product solution of one-dimensional elliptic equations with parameter-dependent coefficients

نویسندگان

  • S. V. Dolgov
  • Vladimir A. Kazeev
  • Boris N. Khoromskij
چکیده

We consider a one-dimensional second-order elliptic equation with a high-dimensional parameter in a hypercube as a parametric domain. Such a problem arises, for example, from the Karhunen Loève expansion of a stochastic PDE posed in a onedimensional physical domain. For the discretization in the parametric domain we use the collocation on a tensor-product grid. The paper is focused on the tensorstructured solution of the resulting multiparametric problem, which allows to avoid the curse of dimensionality owing to the use of the separation of parametric variables in the tensor train and quantized tensor train formats. We suggest an e cient tensor-structured preconditioning of the entire multiparametric family of one-dimensional elliptic problems and arrive at a direct solution formula. We compare this method to a tensor-structured preconditioned GMRES solver in a series of numerical experiments.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Extension of the Legendre-Galerkin Method for Solving Sixth-Order Differential Equations with Variable Polynomial Coefficients

We extend the application of Legendre-Galerkin algorithms for sixth-order elliptic problems with constant coefficients to sixth-order elliptic equations with variable polynomial coefficients. The complexities of the algorithm are O(N) operations for a one-dimensional domain with N − 5 unknowns. An efficient and accurate direct solution for algorithms based on the LegendreGalerkin approximations...

متن کامل

Tensor-structured methods for parameter dependent and stochastic elliptic PDEs

Modern methods of tensor-product decomposition allow an efficient data-sparse approximation of functions and operators in higher dimensions [5]. The recent quantics-TT (QTT) tensor method allows to represent the multidimensional data with log-volume complexity [1, 2, 3]. We discuss the convergence rate of the Tucker, canonical and QTT stochastic collocation tensor approximations to the solution...

متن کامل

Adaptive Sparse Grids for Hyperbolic Conservation Laws

We report on numerical experiments using adaptive sparse grid dis-cretization techniques for the numerical solution of scalar hyperbolic conservation laws. Sparse grids are an eecient approximation method for functions. Compared to regular, uniform grids of a mesh parameter h contain h ?d points in d dimensions, sparse grids require only h ?1 jloghj d?1 points due to a truncated , tensor-produc...

متن کامل

Kernel-based Collocation Methods versus Galerkin Finite Element Methods for Approximating Elliptic Stochastic Partial Differential Equations

We compare a kernel-based collocation method (meshfree approximation method) with a Galerkin finite element method for solving elliptic stochastic partial differential equations driven by Gaussian noise. The kernel-based collocation solution is a linear combination of reproducing kernels obtained from related differential and boundary operators centered at chosen collocation points. Its random ...

متن کامل

Sparse Tensor Discretization of Elliptic sPDEs

We propose and analyze sparse deterministic-stochastic tensor Galerkin finite element methods (sparse sGFEMs) for the numerical solution of elliptic partial differential equations (PDEs) with random coefficients in a bounded physical domain D ⊂ R. The sparse sGFEMs are based on a separation of stochastic and deterministic input variables by Karhunen-Loève expansion of the random diffusion coeff...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Mathematics and Computers in Simulation

دوره 145  شماره 

صفحات  -

تاریخ انتشار 2018